DepQBF: A Dependency-Aware QBF Solver (System Description)
نویسندگان
چکیده
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quantifier prefixes of QBFs in prenex conjunctive normal form (PCNF). DepQBF 0.1 was placed first in the main track of QBFEVAL’10 in a score-based ranking. We provide a general system overview and describe selected orthogonal features such as restarts and removal of learnt constraints.
منابع مشابه
DepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quantifier prefixes of QBFs in prenex conjunctive normal form (PCNF). DepQBF 0.1 was placed first in the main track of QBFEVAL’10 in a score-based ranking. We provide a general system overview and describe selected orthogo...
متن کاملExtracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver
The logic of Quantified Boolean Formulas (QBF) is an extension of propositional logic and provides compact encodings of real world problems in various fields of application, e.g., formal verification, reasoning and artificial intelligence. In recent years, the development of efficient decision procedures for QBF has progressed considerably. However, most current state-of-the-art QBF-solvers ret...
متن کاملDepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
We present the latest version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in pre...
متن کاملLong Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a proof system that combines two proof systems supported by the solver DepQBF: Q-resolution with generalized universal reduction according to a dependency scheme and long distance Q-re...
متن کاملDependency Schemes and Search-Based QBF Solving: Theory and Practice
The logic of quantified Boolean formulae (QBF) extends propositional logic with universal quantification over propositional variables. The presence of universal quantifiers in QBF does not add expressiveness, but often allows for more compact encodings of problems. From a theoretical point of view, the decision problems of propositional logic (SAT) and QBF are NP-complete and PSPACE-complete, r...
متن کامل